What is an Array

Tags: #◇CCPROG2 #◇C Programming #◇Programming #◇Computer Science #◇Data Structures #◇Data Types #◇Structured Programming #◇Memory Management

---

◇Overview

An array is a collection or group of elements of the same data type. It is a homogeneous data structure.

◇Details / Theory

An array is a collection or group of elements of the same data type. It is a homogeneous data structure.
It stores a fixed-size sequential collection of elements of the same type.

Think of an array as a set of memory locations, each storing one item of data, all of which are of the same type and can be accessed by the same name.

Arrays are used to store multiple values in a single variable, instead of declaring separate variables for each value.

Array

◇Common Pitfalls

Thinking arrays can hold mixed types — arrays are homogeneous; all elements must be the same type Assuming arrays are dynamically sized by default — in C, int arr[n] with a variable n requires VLA support or malloc() Confusing an array with a linked list — arrays provide $O(1)$ random access but $O(n)$ insertion/deletion; linked lists are the opposite Forgetting the contiguous memory guarantee — this is what enables $O(1)$ indexed access via base address + offset

◇Summary

TL;DR — An array is a homogeneous, fixed-size, sequential collection of same-type elements stored in contiguous memory locations, accessed by a single name and zero-based index. It provides $O(1)$ random access but cannot change size after declaration.

◇Links

Related: Source / Reference:

◇References & Navigation

• Previous Topic: ◇Introduction to Arrays
• Next Topic: ◇Arrays
• Related Notes: ◇Introduction to Arrays, ◇Data Types